Competition under time-varying demands and dynamic lot sizing costs
نویسندگان
چکیده
منابع مشابه
Competition under Time-Varying Demands and Dynamic Lot Sizing Costs
We develop a competitive pricing model which combines the complexity of time-varying demand and cost functions and that of scale economies arising from dynamic lot sizing costs. Each firm can replenish inventory in each of the T periods into which the planning horizon is partitioned. Fixed as well as variable procurement costs are incurred for each procurement order, along with inventory carryi...
متن کاملCompetition under Capacitated Dynamic Lot Sizing with Capacity Acquisition
Lot-sizing and capacity planning are important supply chain decisions, and competition and cooperation affect the performance of these decisions. In this paper, we look into the dynamic lot sizing and resource competition problem of an industry consisting of multiple firms. A capacity competition model combining the complexity of time-varying demand with cost functions and economies os scale ar...
متن کاملA genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs
The multi-level lot-sizing (MLLS) problem in material requirements planning (MRP) systems belongs to those problems that industry manufacturers daily face in organizing their overall production plans. However, this combinatorial optimization problem can be solved optimally in a reasonable CPU only when very small instances are considered. This legitimates the search for heuristic techniques tha...
متن کاملLot sizing with rework and different inspection costs
This paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. We have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. Further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...
متن کاملLot Sizing with Piecewise Concave Production Costs
We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, overloading, subcontracting or a combination of these. We develop a dynamic programming (DP) algorithm to solve this problem and answer an open question in the literature: we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics (NRL)
سال: 2008
ISSN: 0894-069X
DOI: 10.1002/nav.20321